A Lanczos-type method for multiple starting vectors
نویسندگان
چکیده
Given a square matrix and single right and left starting vectors, the classical nonsymmetric Lanczos process generates two sequences of biorthogonal basis vectors for the right and left Krylov subspaces induced by the given matrix and vectors. In this paper, we propose a Lanczos-type algorithm that extends the classical Lanczos process for single starting vectors to multiple starting vectors. Given a square matrix and two blocks of right and left starting vectors, the algorithm generates two sequences of biorthogonal basis vectors for the right and left block Krylov subspaces induced by the given data. The algorithm can handle the most general case of right and left starting blocks of arbitrary sizes, while all previously proposed extensions of the Lanczos process are restricted to right and left starting blocks of identical sizes. Other features of our algorithm include a built-in deflation procedure to detect and delete linearly dependent vectors in the block Krylov sequences, and the option to employ look-ahead to remedy the potential breakdowns that may occur in nonsymmetric Lanczos-type methods.
منابع مشابه
A Symmetric Band Lanczos Process Based on Coupled Recurrences and Some Applications
The symmetric band Lanczos process is an extension of the classical Lanczos algorithm for symmetric matrices and single starting vectors to multiple starting vectors. After n iterations, the symmetric band Lanczos process has generated an n× n projection, Tn, of the given symmetric matrix onto the n-dimensional subspace spanned by the first n Lanczos vectors. This subspace is closely related to...
متن کاملML(k)BiCGSTAB: A BiCGSTAB Variant Based on Multiple Lanczos Starting Vectors
We present a variant of the popular BiCGSTAB method for solving nonsymmetric linear systems. The method, which we denote by ML(k)BiCGSTAB, is derived from a variant of the BiCG method based on a Lanczos process using multiple (k > 1) starting left Lanczos vectors. Compared with the original BiCGSTAB method, our new method produces a residual polynomial which is of lower degree after the same nu...
متن کاملTranspose-free Multiple Lanczos and Its Application in Padé Approximation
A transpose-free two-sided nonsymmetric Lanczos method is developed for multiple starting vectors on both the left and right. The method is mathematically equivalent to the two-sided methods without look-ahead or deflation steps, but avoids the use of the transpose of the system matrix. The method is applied to the computation of the matrix Padé approximation to a linear dynamical system. The r...
متن کاملTranspose-free Matrix Pad e Via Lanczos Method
A transpose-free two-sided nonsymmetric Lanczos method is developed for multiple starting vectors on both the left and right. The method is applied to the computation of the matrix Pad e approximation to a linear dynamical system. The result is a method which can be labeled Transpose-Free Matrix Pad e Via Lanczos. The method is mathematically equivalent to the two-sided methods, but avoids the ...
متن کاملA Block-QMR Algorithm for Non-Hermitian Linear Systems With Multiple Right-Hand Sides
Many applications require the solution of multiple linear systems that have the same coeecient matrix, but diier in their right-hand sides. Instead of applying an iterative method to each of these systems individually, it is more eecient to employ a block version of the method that generates iterates for all the systems simultaneously. In this paper, we propose a block version of Freund and Nac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 69 شماره
صفحات -
تاریخ انتشار 2000